Abstraction and Set Theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FUZZY SOFT SET THEORY AND ITS APPLICATIONS

In this work, we define a fuzzy soft set theory and its related properties. We then define fuzzy soft aggregation operator that allows constructing more efficient decision making method. Finally, we give an example which shows that the method can be successfully applied to many problems that contain uncertainties.

متن کامل

Instruction Set Architecture Abstraction

This technical report describes CHERI ISAv3, the third version of the This report describes the CHERI Instruction-Set Architecture (ISA) and design. The purpose of this tutorial was to introduce the computer architecture Pydgin is a framework for rapidly developing instruction-set simulators (ISSs) from a but is particularly well-suited for exploring the hardware/software abstraction. The Intel...

متن کامل

Reduced Function Set Abstraction (RFSA)

In this paper we present RFSA, a Reduced Function Set Abstraction based on an existing parallel programming model as a potential programming model for Data-Intensive Supercomputing (DISC) applications. Our RFSA uses either a select or a merge procedure to reduce the number of function calls in existing programming models. In the current version, we build RFSA on top of Message Passing Interface...

متن کامل

2 a Theory of Abstraction Using Abstraction

Korf Korf, 1979] provides a similar computational analysis of the beneets of abstraction for state space search. This analysis is essentially restricted to Abstrips abstractions as it ignores the cost of building abstract proof plans. Like us, Korf assumes no mapping failures, and a constant branching rate. Finally, in Giunchiglia & Walsh, 1989b] we analysed the theoretical and empirical proper...

متن کامل

Range and Set Abstraction using SAT

Symbolic decision trees are not the only way to correlate the relationship between flags and numeric variables. Boolean formulae can also represent such relationships where the integer variables are modelled with bit-vectors of propositional variables. Boolean formula can be composed to express the semantics of a block and program state, but they are hardly tractable, hence the need to compute ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 2000

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1038336882